Path graph

Results: 1083



#Item
201On the Searchability of Small-World Networks ∗ with Arbitrary Underlying Structure Pierre Fraigniaud  George Giakkoupis

On the Searchability of Small-World Networks ∗ with Arbitrary Underlying Structure Pierre Fraigniaud George Giakkoupis

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-04-12 08:36:01
202On Universal Cycles of Labeled Graphs Greg Brockman Bill Kay  Harvard University

On Universal Cycles of Labeled Graphs Greg Brockman Bill Kay Harvard University

Add to Reading List

Source URL: www.gregbrockman.com

Language: English - Date: 2015-05-09 15:47:45
203Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs arXiv:1405.5848v6 [cs.RO] 26 FebJonathan D. Gammell1 , Siddhartha S. Srinivasa2

Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs arXiv:1405.5848v6 [cs.RO] 26 FebJonathan D. Gammell1 , Siddhartha S. Srinivasa2

Add to Reading List

Source URL: www.ri.cmu.edu

Language: English - Date: 2015-05-20 10:11:27
204Asymptotically Near-Optimal Planning with Probabilistic Roadmap Spanners James D. Marble and Kostas E. Bekris I. I NTRODUCTION Roadmap planners [1] utilize an off-line phase to build

Asymptotically Near-Optimal Planning with Probabilistic Roadmap Spanners James D. Marble and Kostas E. Bekris I. I NTRODUCTION Roadmap planners [1] utilize an off-line phase to build

Add to Reading List

Source URL: www.cse.unr.edu

Language: English - Date: 2012-12-20 19:29:50
205Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin

Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin

Add to Reading List

Source URL: select.cs.cmu.edu

Language: English - Date: 2009-08-13 03:47:05
206Distributed Chasing of Network Intruders L´elia Blin1 , Pierre Fraigniaud2 , Nicolas Nisse2 , and Sandrine Vial1 1 2

Distributed Chasing of Network Intruders L´elia Blin1 , Pierre Fraigniaud2 , Nicolas Nisse2 , and Sandrine Vial1 1 2

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2007-01-17 10:04:46
207In Search of a Scalable, Parallel Branch-and-Bound for Two-Stage Stochastic Integer Optimization Akhil Langer‡ , Ramprasad Venkataraman‡ , Udatta Palekar∗ , Laxmikant V. Kale‡ ‡  Department of Computer Science,

In Search of a Scalable, Parallel Branch-and-Bound for Two-Stage Stochastic Integer Optimization Akhil Langer‡ , Ramprasad Venkataraman‡ , Udatta Palekar∗ , Laxmikant V. Kale‡ ‡ Department of Computer Science,

Add to Reading List

Source URL: charm.cs.illinois.edu

Language: English - Date: 2013-03-28 16:07:21
208On Randomized Representations of Graphs Using Short Labels ∗ Pierre Fraigniaud

On Randomized Representations of Graphs Using Short Labels ∗ Pierre Fraigniaud

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-02-08 08:39:17
209Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1  4

Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1 4

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2012-04-26 12:04:26
210Parallel Breadth First Search on GPU Clusters Zhisong Fu SYSTAP, LLC   Harish Kumar Dasari

Parallel Breadth First Search on GPU Clusters Zhisong Fu SYSTAP, LLC Harish Kumar Dasari

Add to Reading List

Source URL: www.blazegraph.com

Language: English - Date: 2015-02-12 16:09:50